Dynamic minimum bichromatic separating circle
نویسندگان
چکیده
منابع مشابه
Minimum separating circle for bichromatic points by linear programming
Consider two point sets in the plane, a red set and a blue set. We show how to find the smallest circle that encloses all red points and as few blue points as possible in its interior, using linear programming with violations.
متن کاملSeparating bichromatic point sets by L-shapes
Given a set R of red points and a set B of blue points in the plane, we study the problem of determining all angles for which there exists an L-shape containing all points from B and no points from R. We propose a worst-case optimal algorithm to solve this problem in O(n) time and O(n) storage, where n = |R| + |B|. We also describe an output-sensitive algorithm that reports these angles in O(n ...
متن کاملPlanar bichromatic minimum spanning trees
Given a set S of n red and blue points in the plane, a planar bichromatic minimum spanning tree is the shortest possible spanning tree of S, such that every edge connects a red and a blue point, and no two edges intersect. Computing this tree is NP-hard in general. We present an O(n) time algorithm for the special case when all points are in convex position. For the general case, we present a f...
متن کاملComputing Minimum-Link Separating Polygons in Practice∗
We tackle the problem of separating two given sets of polygons by a polygon with minimum number of segments. As the complexity in our specific setting is unknown, we propose heuristics that are simple enough to be implemented in practice. A key ingredient is a new practical linear-time algorithm for minimum-link paths in simple polygons. Experiments in a challenging realistic setting show excel...
متن کاملMinimum feedback vertex sets in circle graphs
We describe a polynomial time algorithm to find a minimum feedback vertex set, or equivalently, a maximum induced forest, in a circle graph. The circle graphs are the overlap graphs of intervals on a line.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.11.036